منابع مشابه
Sequential Coding of Gauss–Markov Sources
We consider the problem of sequential transmission of Gauss–Markov sources. We show that in the limit of large spatial block lengths, greedy compression with respect to the squared error distortion is optimal; that is, there is no tension between optimizing the distortion of the source in the current time instant and that of future times. We then extend this result to the case where at time t a...
متن کاملOptimal Sequential Vector Quantization of Markov Sources
The problem of sequential vector quantization of a stationary Markov source is cast as an equivalent stochastic control problem with partial observations. This problem is analyzed using the techniques of dynamic programming, leading to a characterization of optimal encoding schemes.
متن کاملEntropic measures, Markov information sources and complexity
The concept of entropy plays a major part in communication theory. The Shannon entropy is a measure of uncertainty with respect to a priori probability distribution. In algorithmic information theory the information content of a message is measured in terms of the size in bits of the smallest program for computing that message. This paper discusses the classical entropy and entropy rate for dis...
متن کاملRobust decoding of VLC encoded Markov sources
The problem of robust decoding of VLC encoded streams in presence of channel errors is essentially a problem of joint estimation and segmentation of the bit stream. A correct segmentation and estimation of a VLC compressed stream in presence of channel noise requires to re-augment the redundancy of the stream. Instead of using a channel code, the approach described here dedicates specifically e...
متن کاملJoint String Complexity for Markov Sources
String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we define joint string complexity as the set of words that are common to both strings. We also relax this definition and introduce joint semi-complexity restricted to the common words appearing at least twice in both strings. String complexity finds a number of applicatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sociological Methods & Research
سال: 2007
ISSN: 0049-1241,1552-8294
DOI: 10.1177/0049124106295975